Code vector density in topographic mappings: Scalar case
نویسنده
چکیده
The author derives some new results that build on his earlier work (1989) of combining vector quantization (VQ) theory and topographic mapping (TM) theory. A VQ model (with a noisy transmission medium) is used to model the processes that occur in TMs, which leads to the standard TM training algorithm, albeit with a slight modification to the encoding process. To emphasize this difference, the model is called a topographic vector quantizer (TVQ). In the continuum limit of the one-dimensional (scalar) TVQ. It is found that the density of code vectors is proportional to P(x)(a) (alpha=1/3) assuming that the transmission medium introduces additive noise with a zero-mean, symmetric, monotically decreasing probability density. This result is dramatically different from the result that is predicted when the standard TM training algorithm is used with a uniform symmetric neighborhood [-n, +n], and it is noted that this difference arises entirely from using minimum distortion rather than nearest neighbor encoding.
منابع مشابه
Lower Semicontinuous Regularization for Vector-Valued Mappings
The concept of the lower limit for vector-valued mappings is the main focus of this work. We first introduce a new definition of adequate lower and upper level sets for vector-valued mappings and establish some of their topological and geometrical properties. Characterization of semicontinuity for vector-valued mappings is thereafter presented. Then, we define the concept of vector lower limit,...
متن کاملReconstruction of sequential data with density models
We introduce the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is independent of the sequence index. The problem is hard because it involves possibly multivalued mappings at each vector in the sequence, where the missing variabl...
متن کاملLipschitz Properties of Convex Mappings
The present paper is concerned with Lipschitz properties of convex mappings. One considers the general context of mappings defined on an open convex subset Ω of a locally convex space X and taking values in a locally convex space Y ordered by a normal cone. One proves also equi-Lipschitz properties for pointwise bounded families of continuous convex mappings, provided the source space X is barr...
متن کاملInversion of Incidence Mappings
Denote by H(t, q), t ≤ q, the incidence matrix (with respect to inclusion) of the t–sets versus the q–sets of the n–set {1, 2, . . . , n}. This matrix is considered as a linear map of Q–vector spaces Cq(n) −→ Ct(n), where Cs(n) is the Q–vector space having the s–sets as a basis (s ≤ n). As a basic tool, we introduce a connection of the vector spaces to a graded Q–algebra (which is at the same t...
متن کاملیادداشتی بر دوگانی AdS/CFT
We study duality of field theories in (d+1) dimensional flat Euclidean space and (d+1) dimensional Euclidean AdS space for both scalar the and vector fields. In the case of the scalar theory, the injective map between conformally coupled massless scalars in two spaces is reviewed. It is shown that for vector fields the injective map exists only in four dimensions. Since Euclidean AdS space is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on neural networks
دوره 2 4 شماره
صفحات -
تاریخ انتشار 1991